Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Paliath Narendran And NotFranche-Comté

List of bibliographic references

Number of relevant bibliographic references: 34.
Ident.Authors (with country if any)Title
001526 Christopher Bouchard [États-Unis] ; Kimberly A. Gero [États-Unis] ; Christopher Lynch [États-Unis] ; Paliath Narendran [États-Unis]On Forward Closure and the Finite Variant Property
001578 Serdar Erbatur [Italie] ; Deepak Kapur [États-Unis] ; Andrew M. Marshall [États-Unis] ; Paliath Narendran [États-Unis] ; Christophe Ringeissen [France]Hierarchical Combination
003002 Siva Anantharaman [France] ; Hai Lin [États-Unis] ; Christopher Lynch [États-Unis] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Unification Modulo Homomorphic Encryption
003877 Siva Anantharaman [France] ; Hai Lin [États-Unis] ; Christopher Lynch [États-Unis] ; Paliath Narendran [États-Unis] ; Michaël Rusinowitch [France]Unification Modulo Homomorphic Encryption
004C40 Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Intruders with Caps
006376 Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Closure properties and decision problems of dag automata
006945 Siva Anantharaman ; Paliath Narendran ; Michael RusinowitchUnification Modulo ACUI Plus Distributivity Axioms
006B10 Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Unification Modulo ACUI Plus Distributivity Axioms
006F93 Siva Anantharaman [France] ; Paliath Narendran [France] ; Michaël Rusinowitch [France]How Useful are Dag Automata?
007366 Hubert Comon ; Paliath Narendran ; Robert Nieuwenhuis ; Michael RusinowitchDeciding the Confluence of Ordered Term Rewrite Systems
007454 Hubert Comon-Lundh [France] ; Paliath Narendran [États-Unis] ; Robert Nieuwenhuis ; Michaël Rusinowitch [France]Deciding the Confluence of Ordered Term Rewrite Systems
007969 Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Unification Modulo ACUI Plus Homomorphisms/Distributivity
007B04 Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]ACID -Unification Is NEXPTIME-Decidable
007D19 Siva Anantharaman ; Paliath Narendran [France] ; Michaël Rusinowitch [France]ACID-Unification is NEXPTIME-Decidable
007D29 Siva Anantharaman [France] ; Paliath Narendran [France] ; Michaël Rusinowitch [France]Unification modulo ACUI plus Homomorphisms/Distributivity
009986 Paliath Narendran ; Michael RusinowitchThe theory of total unary RPO is decidable
009E14 Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]The Theory of Total Unary RPO Is Decidable
00A123 Paliath Narendran [États-Unis] ; Michaël Rusinowitch [France]The theory of total unary RPO is decidable
00A764 Paliath Narendran ; Michael RusinowitchRewriting Techniques and Applications
00A946 Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] ; Rakesh Verma [États-Unis]RPO Constraint Solving Is in NP
00AC40 Paliath Narendran ; Michaël Rusinowitch [France]Rewriting Techniques & Applications
00B070 Paliath Narendran ; Michael Rusinowitch ; Rakesh VermaRPO constraint solving is in NP
00B071 Paliath Narendran ; Michael Rusinowitch ; Rakesh VermaRPO constraint solving is in NP
00B196 Hubert Comon ; Paliath Narendran ; Robert Nieuwenhuis ; Michael RusinowitchDecision problems in ordered rewriting
00B595 Paliath Narendran [France] ; Michaël Rusinowitch ; Rakesh VermaRPO constraint solving is in NP
00B596 Paliath Narendran [France] ; Michaël Rusinowitch ; Rakesh VermaRPO constraint solving is in NP
00B668 Hubert Comon [France] ; Paliath Narendran ; Robert Nieuwenhuis ; Michaël RusinowitchDecision problems in ordered rewriting
00BA89 Hubert Comon ; Paliath Narendran ; Michael RusinowitchDecision Problems in Ordered Rewriting
00C093 Paliath Narendran [États-Unis] ; Michaël Rusinowitch [France]Any ground associative-commutative theory has a finite canonical system
00DA85 Paliath Narendran [États-Unis] ; Michaël Rusinowitch [France]Any ground associative-commutative theory has a finite canonical system
00E357 Jean Gallier ; Paliath Narendran [États-Unis] ; David Plaisted ; Stan Raatz [États-Unis] ; Wayne SnyderFinding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time
00E359 Paliath Narendran [États-Unis] ; Friedrich Otto [États-Unis]Elements of finite order for finite weight-reducing and confluent thue systems
00E607 Deepak Kapur [États-Unis] ; Paliath Narendran [États-Unis] ; Hantao Zhang [États-Unis]On sufficient-completeness and related properties of term rewriting systems
00E830 Deepak Kapur [États-Unis] ; Paliath Narendran [États-Unis] ; Hantao Zhang [États-Unis]Proof by induction using test sets
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022